Explicit endomorphism of the Jacobian of a hyperelliptic function field of genus 2 using base field operations

نویسندگان

  • Eduardo Ruiz Duarte
  • Octavio Páez Osuna
چکیده

We present an efficient endomorphism for the Jacobian of a curve C of genus 2 for divisors having a Non disjoint support. This extends the work of Costello in [12] who calculated explicit formulæ for divisor doubling and addition of divisors with disjoint support in JF(C) using only base field operations. Explicit formulæ is presented for this third case and a different approach for divisor doubling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Endomorphism for any Genus 2 Hyperelliptic Curve over a Finite Field of Even Characteristic

In EUROCRYPT 2009, Galbraith, Lin and Scott constructed an efficiently computable endomorphism for a large family of elliptic curves defined over finite fields of large characteristic. They demonstrated that the endomorphism can be used to accelerate scalar multiplication in the elliptic curve cryptosystem based on these curves. In this paper we extend the method to any genus 2 hyperelliptic cu...

متن کامل

Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions

The use of elliptic and hyperelliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test whether the Jacobian – over a finite field Fq – of a hyperelliptic curve of the form Y 2 = X + aX + bX (with a, b ∈ Fq) has a large prime factor. His approach is to obtain candidates for the ...

متن کامل

Pairings on Jacobians of Hyperelliptic Curves

Consider the Jacobian of a hyperelliptic genus two curve de ned over a nite eld. Under certain restrictions on the endomorphism ring of the Jacobian, we give an explicit description of all non-degenerate, bilinear, anti-symmetric and Galois-invariant pairings on the Jacobian. From this description it follows that no such pairing can be computed more e ciently than the Weil pairing. To establish...

متن کامل

Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y2=x2k+1+ax

Computing the order of the Jacobian group of a hyperelliptic curve over a finite field is very important to construct a hyperelliptic curve cryptosystem (HCC), because to construct secure HCC, we need Jacobian groups of order in the form l · c where l is a prime greater than about 2 and c is a very small integer. But even in the case of genus two, known algorithms to compute the order of a Jaco...

متن کامل

Group Law Computations on Jacobians of Hyperelliptic Curves

We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the geometric description of the group law and applies to hyperelliptic curves of arbitrary genus. While Cantor’s general composition involves arithmetic in the polynomial ring Fq[x], the algorithm we propose solves a linear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014